Computational Realizations of Living Systems

نویسندگان

  • Dominique Chu
  • Weng Kin Ho
چکیده

Robert Rosen's central theorem states that organisms are fundamentally different from machines, mainly because they are "closed with respect to effcient causation." The proof for this theorem rests on two crucial assumptions. The first is that for a certain class of systems ("mechanisms") analytic modeling is the inverse of synthetic modeling. The second is that aspects of machines can be modeled using relational models and that these relational models are themselves refined by at least one analytic model. We show that both assumptions are unjustified. We conclude that these results cast serious doubts on the validity of Rosen's proof.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Simulation of Biochemical Systems on the Graphics Processing Unit

Motivation: In biological systems formed by living cells, the small populations of some reactant species can result in inherent randomness which cannot be captured by traditional deterministic approaches. In that case, a more accurate simulation can be obtained by using the Stochastic Simulation Algorithm (SSA). Many stochastic realizations are required to capture accurate statistical informati...

متن کامل

Efficient Parallelization of the Stochastic Simulation Algorithm for Chemically Reacting Systems On the Graphics Processing Unit

The small number of some reactant molecules in biological systems formed by living cells can result in dynamical behavior which cannot be captured by traditional deterministic models. In such a problem, a more accurate simulation can be obtained with discrete stochastic simulation (Gillespie’s stochastic simulation algorithm – SSA). Many stochastic realizations are required to capture accurate ...

متن کامل

Frequency-domain realizations of adaptive parallel-cascade quadratic filters

Parallel-cascade realizations of truncated Volterra systems implement higher-order systems using a parallel connection of multiplicative combinations of lower-order systems. Such realizations are modular and permit efficient approximations of truncated Volterra systems. Frequency-domain realizations of the leastmean-square (LMS) adaptive filter and the normalized LMS adaptive filter that implem...

متن کامل

Computation of Minimal Realizations of Periodic Systems

We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The first method belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be used to compute balanced minimal order realizations. An alternative balancing-free square-root method has the advantage of a pote...

متن کامل

A fast Gauss-Newton parallel-cascade adaptive truncated Volterra filter

This paper introduces a computationally e cient Gauss-Newton type adaptation algorithm for parallel-cascade realizations of truncated Volterra systems with arbitrary, but nite order nonlinearity. Parallel-cascade realizations implement higher-order Volterra systems using parallel and multiplicative combinations of lower-order Volterra systems. The complexity of our system is comparable to the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artificial life

دوره 13 4  شماره 

صفحات  -

تاریخ انتشار 2007